Stochastic phonological grammars and acceptability

نویسندگان

  • John Coleman
  • Janet B. Pierrehumbert
چکیده

In foundational works of generative phonology it is claimed that subjects can reliably discriminate between possible but non-occurring words and words that could not be English. In this paper we examine the use of a pr0babilistic phonological parser for words to model experimentally-obtained judgements of the acceptability of a set of nonsense words. We compared various methods oft scoring the goodness of the parse as a predictor of acceptability. We found that the probability of the worst part is not the best score of acceptability, indicating that classical generative phonology and Optimality Theory miss an important fact, as these app[oaches do not recognise a mechanism by which the frequency of wellformed parts may ameliorate the unacceptability of low-frequency parts. We argue that probabilistic generative grammars are demonstrably a more psychologically realistic model of phonological competence than standard generative phonology or Optimality Theory.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linking speech errors and phonological grammars: Insights from Harmonic Grammar networks.

Phonological grammars characterize distinctions between relatively well-formed (unmarked) and relatively ill-formed (marked) phonological structures. We review evidence that markedness influences speech error probabilities. Specifically, although errors result in both unmarked as well as marked structures, there is a markedness asymmetry: errors are more likely to produce unmarked outcomes. We ...

متن کامل

Similarity and phonotactics in Arabic

The statistical patterns of language are systematic linguistic data which must be accounted for in linguistic theory. The phonotactics of the Arabic verbal roots are presented as a case study. In Arabic, the acceptability of a verbal root is gradiently dependent on the similarity of homorganic consonant pairs within the root. We propose the stochastic constraint model of phonological patterning...

متن کامل

Computational Phonology - Part II: Grammars, Learning, and the Future

Computational phonology studies sound patterns in the world’s languages from a computational perspective. This article shows that the similarities between different generative theories outweigh the differences, and discusses stochastic grammars and learning models within phonology from a computational perspective. Also, it shows how the hypothesis that all sound patterns are subregular can be i...

متن کامل

Learning Repairs for Marked Structures

This paper presents an algorithm which learns phonological grammars. These phonological grammars— like grammars in Optimality Theory (OT, Prince & Smolensky, 2004) or rule-based grammars (Chomsky & Halle, 1968)—describe phonological maps, or the transformations from input (underlying) forms to output (surface) forms (Tesar, 2014). Like OT grammars, the grammars which underlie the algorithm dist...

متن کامل

1 Linking speech errors and phonological grammars :

Phonological grammars characterize distinctions between relatively well-formed (unmarked) and relatively ill-formed (marked) phonological structures. We review evidence that markedness influences speech error probabilities. Specifically, although errors result in both unmarked as well as marked structures, there is a markedness asymmetry: errors are more likely to produce unmarked outcomes. We ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cmp-lg/9707017  شماره 

صفحات  -

تاریخ انتشار 1997